A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
نویسندگان
چکیده
The Capacitated Vehicle Routing problem is a generalization of the Traveling Salesman problem in which a set of clients must be visited by a collection of capacitated tours. Each tour can visit at most Q clients and must start and end at a specified depot. We present the first approximation scheme for Capacitated Vehicle Routing for non-Euclidean metrics. Specifically we give a quasi-polynomial-time approximation scheme for Capacitated Vehicle Routing with fixed capacities on planar graphs. We also show how this result can be extended to bounded-genus graphs and polylogarithmic capacities, as well as to variations of the problem that include multiple depots and charging penalties for unvisited clients. 1998 ACM Subject Classification G.2.2 Graph Algorithms
منابع مشابه
Polynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملApproximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملApproximation of minimum weight spanners for sparse graphs
A t-spanner of a graph G is its spanning subgraph S such that the distance between every pair of vertices in S is at most t times their distance in G. The sparsest t-spanner problem asks to find, for a given graphG and an integer t , a t-spanner ofGwith theminimumnumber of edges. The problem is known to be NP-hard for all t ≥ 2, and, even more, it is NP-hard to approximate it with ratio O(log n...
متن کاملZero-free regions of partition functions with applications to algorithms and graph limits
Based on a technique of Barvinok [3, 4, 5] and Barvinok and Soberón [6, 7] we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation scheme for computing these partition functions. As another application we show that the normalised partition functions of these models are cont...
متن کاملGrigni: [15] Approximate TSP in Graphs with Forbidden Minors
Given as input an edge-weighted graph, we analyze two algorithms for nding subgraphs with low total edge weight. The rst algorithm nds a separator subgraph with a small number of components, and is analyzed for graphs with an arbitrary excluded minor. The second algorithm nds a spanner with small stretch factor, and is analyzed for graphs in a hereditary family G(k). These results imply (i) a Q...
متن کامل